Definable Davies' theorem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Definable Davies’ Theorem

We prove the following descriptive set-theoretic analogue of a Theorem of R.O. Davies: Every Σ2 function f : R× R → R can be represented as a sum of rectangular Σ2 functions if and only if all reals are constructible.

متن کامل

The Strength of the Besicovitch-Davies Theorem

A theorem of Besicovitch and Davies implies for Cantor space 2 that each Σ1 (analytic) class of positive Hausdorff dimension contains a Π1 (closed) subclass of positive dimension. We consider the weak (Muchnik) reducibility ≤w in connection with the mass problem S(U) of computing a set X ⊆ ω such that the Σ 1 class U of positive dimension has a Π 1 (X) subclass of positive dimension. We determi...

متن کامل

A definable Borsuk-Ulam type theorem

Let N = (R,+, ·, <, . . . ) be an o-minimal expansion of the standard structure of a real closed field R. A definably compact definable group G is a definable Borsuk-Ulam group if there exists an isovariant definable map f : V → W between representations of G, then dimV − dimV G ≤ dimW − dimW. We prove that if a finite group G satisfies the prime condition, then G is a definable Borsuk-Ulam gro...

متن کامل

On externally definable sets and a theorem of Shelah

In [4] Saharon Shelah proves the striking and important result that if T is a complete theory without the independence property,M is a model of T , and M∗ is the expansion of M by adjoining predicates for “externally definable” subsets of M,M ×M, ..., then Th(M∗) has quantifier elimination. Shelah’s proof is not so long, but arguably rather obscure. The aim of this expository paper is to give a...

متن کامل

Gödel-Rosser's Incompleteness Theorem, generalized and optimized for definable theories

Gödel’s First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a syntactic-semantic notion (that is the consistency of a theory with the set of all true Πn sentences or equivalently the Σn soundness of the theory) that corresponds to Gödel’s notion of ω-consistency in an appropriate way. It is also shown that Rosser’s Incomp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 2009

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm205-1-4